Experiments with Two-Row Cuts from Degenerate Tableaux
نویسندگان
چکیده
Amitabh Basu Tepper School of Business, Carnegie Mellon University, Pittsburgh, PA 15213. Pierre Bonami LIF, Faculté des Sciences de Luminy, Université de Marseille, France. Gérard Cornuéjols Tepper School of Business, Carnegie Mellon University, Pittsburgh, PA 15213; and LIF, Faculté des Sciences de Luminy, Université de Marseille, France. François Margot Tepper School of Business, Carnegie Mellon University, Pittsburgh, PA 15213.
منابع مشابه
Computing with Multi-Row Intersection Cuts
Cutting planes are one of the main techniques currently used to solve large-scale MixedInteger Linear Programming (MIP) models. Many important cuts used in practice, such as Gomory Mixed-Integer (GMI) cuts, are obtained by solving the linear relaxation of the MIP, extracting a single row of the simplex tableau, then applying integrality arguments to it. A natural extension, which has received r...
متن کاملIntersection Cuts for Single Row Corner Relaxations
We consider the problem of generating inequalities that are valid for one-row relaxations of a simplex tableau, with the integrality constraints preserved for one or more non-basic variables. These relaxations are interesting because they can be used to generate cutting planes for general mixed-integer problems. We first consider the case of a single nonbasic integer variable. This relaxation i...
متن کاملComputational Experiments with Cross and Crooked Cross Cuts
In a recent paper, Dash, Dey and Günlük (2010) showed that many families of inequalities for the two-row continuous group relaxation and variants of this relaxation are cross cuts or crooked cross cuts, both of which generalize split cuts. Li and Richard (2008) recently studied t-branch split cuts for mixedinteger programs for integers t ≥ 1. Split cuts are just 1-branch split cuts, and cross c...
متن کاملOn the Practical Strength of Two-Row Tableau Cuts
Following the flurry of recent theoretical work on cutting planes from two-row mixed integer group relaxations of an LP tableau, we report on computational tests to evaluate the strength of two-row cuts based on lattice-free triangles having more than one integer point on one side. A heuristic procedure to generate such triangles (referred to in the literature as “type 2” triangles) is presente...
متن کاملMulti-row approaches to cutting plane generation
This thesis focuses on the use of cutting-plane techniques to improve general-purpose mixed-integer linear programming solvers. The first topic covered here is a fast separation method for two-row cuts. Two-row cuts are intersection cuts from two rows of a simplex tableau describing the LP relaxation of the problem. These types of cuts recently garnered a lot of attention from the scientific co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- INFORMS Journal on Computing
دوره 23 شماره
صفحات -
تاریخ انتشار 2011